Throughput-Driven Partitioning of Stream Programs on Heterogeneous Distributed Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling Driven Partitioning of Heterogeneous Embedded Systems

In this paper we present an algorithm for system level hardware/software partitioning of heterogeneous embedded systems. The system is represented as an abstract graph which captures both data-flow and the flow of control. Given an architecture consisting of several processors, ASICs and shared busses, our partitioning algorithm finds the partitioning with the smallest hardware cost and is able...

متن کامل

Schedulability-Driven Partitioning of Heterogeneous Real-Time Systems

During the development of a real-time system, the main goal is to nd an implementation that satis es the system's speci ed worst-case timing constraints. Often, the most cost-e ective solution is a heterogeneous implementation, where some parts of the functionality are implemented in software, and the rest in hardware, using application-speci c circuits. Hardware/software codesign allows the de...

متن کامل

Buffer Sizing for Self-timed Stream Programs on Heterogeneous Distributed Memory Multiprocessors

Stream programming is a promising way to expose concurrency to the compiler. A stream program is built from kernels that communicate only via point-to-point streams. The stream compiler statically allocates these kernels to processors, applying blocking, fission and fusion transformations. The compiler determines the sizes of the communication buffers, which affects performance since local memo...

متن کامل

PMJoin: Optimizing Distributed Multi-way Stream Joins by Stream Partitioning

In emerging data stream applications, data sources are typically distributed. Evaluating multi-join queries over streams from different sources may incur large communication cost. As queries run continuously, the precious bandwidths would be aggressively consumed without careful optimization of operator ordering and placement. In this paper, we focus on the optimization of continuous multi-join...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Parallel and Distributed Systems

سال: 2016

ISSN: 1045-9219

DOI: 10.1109/tpds.2015.2416726